Least-Delay Widest-Bandwidth Routing Algorithm*

In this paper, available bandwidth instead of cost is taken as the prime metric of the routing algorithms in that available bandwidth is the appropriate representative of the real network. On account of concave bandwidth, this paper first presents a novel k-widest paths algorithm. Then, a novel end-to-end least-delay widest-available bandwidth path routing algorithm based on k-widest paths is proposed. The correctness and looplessness of the novel algorithm are proved as well as its polynomial complexity. Key-Words: Group multicast, Routing algorithm, Available bandwidth, Delay, Cost, K-widest paths